Receiver and method for incorporating channel state information into maximum ratio combining of a plurality of received signals

ABSTRACT

A receiver including a plurality of receiver pathways. The plurality of receiver pathways are configured to receive, via respective receive antennas, a radio frequency signal transmitted over a communication channel and generate a plurality of respective baseband signals corresponding to the radio frequency signal. A channel estimator is configured to generate an estimate of the channel based on the plurality of respective baseband signals. A demodulator is configured to generate, based on the plurality of respective baseband signals and the estimate of the channel, channel state information corresponding to the communication channel, perform maximum ratio combining on the plurality of respective baseband signals using the channel state information, and generate, based on the estimate of the channel, a plurality of demodulated symbols that incorporate the channel state information. A decoder is configured to perform decoding on the plurality of demodulated symbols to generate respective decoded symbols.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.13/947,562 (now U.S. Pat. No. 8,731,085), filed Jul. 22, 2013, which isa continuation of U.S. patent application Ser. No. 13/400,291 (now U.S.Pat. No. 8,494,068), filed Feb. 20, 2012, which is a continuation ofU.S. patent application Ser. No. 12/686,111 (now U.S. Pat. No.8,126,074), filed Jan. 12, 2010, which is a continuation of U.S. patentapplication Ser. No. 12/214,266 (now U.S. Pat. No. 7,646,821), filedJun. 16, 2008, which is a continuation of U.S. patent application Ser.No. 11/449,502 (now U.S. Pat. No. 7,388,924), filed Jun. 8, 2006, whichis a continuation of U.S. patent application Ser. No. 10/259,024 (nowU.S. Pat. No. 7,065,146), filed Sep. 26, 2002, which claims the benefitunder 35 U.S.C. §119(e)(1) of U.S. Provisional Application No.60/357,317, filed Feb. 15, 2002. The disclosures of the aboveapplications are incorporated herein by reference.

TECHNICAL FIELD

The invention generally relates to symbol modulated communicationtechniques, and more particularly, to a method and apparatus forequalization and decoding in a wireless communications systems includingplural receive antennae.

BACKGROUND

The past few years has witnessed the ever-increasing availability ofrelatively cheap, low power wireless data communication services,networks and devices, promising near wire speed transmission andreliability. One technology in particular, described in the IEEEStandard 802.11a (1999) and Draft IEEE Standard 802.11g (2002) High RatePHY Supplements to the ANSI/IEEE Standard 802.11, 1999 editioncollectively incorporated herein fully by reference, has recently beencommercialized with the promise of 54 Mbps effective bandwidth, makingit a strong competitor to traditional wired Ethernet and the moreubiquitous “802.11b” or “WiFi” 11 Mbps mobile wireless transmissionstandard.

IEEE 802.11a and 802.11g or “802.11a/g” compliant transmission systemsachieve their high data transmission rates using Orthogonal FrequencyDivision Modulation or OFDM encoded symbols mapped up to 64 QAMmulticarrier constellation. Before final power amplification andtransmission, the multicarrier OFDM symbol encoded symbols are convertedinto the time domain using Inverse Fast Fourier Transform techniquesresulting in a relatively high-speed time domain signal with a largepeak-to-average ratio (PAR). OFDM is also used in fixed broadbandwireless access systems such as proposed in IEEE Standard 802.16a: AirInterface for Fixed Broadband Wireless Access Systems Part A: Systemsbetween 2 and 1 GHz, Draft working document, February 2002, (“802.16a”)which is incorporated herein fully by reference

The receiver portion of a wireless communications system compliant withthe aforementioned 802.11a/802.11g and 802.16a standards generallyincludes an RF receiving unit to handle RF downconversion and filteringof received signals in one or more stages and a baseband processing unitto demodulate OFDM encoded symbols bearing the data of interest. FIG. 2illustrates a known receiver baseband processing unit 200, a channelmodel 201 and a corresponding encoding transmitter baseband processor260 to conceptually illustrate the relationship between a received OFDMsymbol Y_(n), in relation to its originally transmitted counterpart OFDMsymbol X_(n), and the pre FEQ version {tilde over (X)}_(n), taking intoaccount the channel impulse response h(t) and intervening noise v(t)(Additive White Gaussian Noise or AWGN in particular), assuming that thechannel impulse response h(t) is shorter than the guard interval (usinge.g. cyclic prefix). To ease understanding, conventional RF upconversiontransmission, and downconversion interposing the baseband processingunits 200 and 260, are omitted from FIG. 2. More specifically, thechannel model 201 illustrates the following relationship:Y _(k,n) =g _(n) H _(k,n) ·X _(k,n) +g _(n) v _(k,n)  (0)where X_(k,n) is the transmitted symbol of the k^(th) sub-carrier duringthe n^(th) OFDM symbol, H_(k,n) is the channel response corresponding tothe k^(th) subcarrier during the n^(th) OFDM symbol, and v_(k,n) is theAWGN in the k^(th) sub-carrier during the n^(th) OFDM symbol. Here,g_(n) represents the gain compensation for the baseband signal conveyingthe symbol Y_(n) provided by an automatic gain control unit (not shown)to maximize the dynamic range and performance of analog to digitalconversion. Here, assume g_(n)=1 since, in the single receive path case,g_(n) is common to all subcarriers and will not therefore affect viterbidecoder performance.

The digital form of each Y_(n) OFDM symbol presented in the frequencydomain is recovered after conventional analog-digital conversion andfast fourier transformation by the ADC 205 and the FFT unit 208respectively of the received time domain analog baseband signal.Thereafter, demodulation (phase rotation) and Frequency domainEQualization (FEQ) through a FEQ unit 220 is performed on the FastFourier Transform (FFT) output to compute X (Equation 1 below) beforesending it to the viterbi decoder 230 to estimate the most likelytransmitted symbol {circumflex over (X)}_(n) at the transmitter. Thatis, the FEQ 220 computes:

$\begin{matrix}{{\overset{\_}{X}}_{k,n} = {\frac{Y_{k,n}}{{\overset{\_}{H}}_{k,n}} = \frac{{\overset{\_}{H}}_{k,n}^{*} \cdot Y_{k,n}}{{{\overset{\_}{H}}_{k,n}}^{2}}}} & (1)\end{matrix}$where: 1) X _(k,n) is the demodulated symbol of the k^(th) sub-carrierduring the n^(th) OFDM symbol; 2) Y_(k,n) is the received noisy symbolof the k^(th) subcarrier during the n^(th) OFDM symbol; and 3) H _(k,n)is the channel estimate corresponding to the k^(th) subcarrier duringthe n^(th) OFDM symbol.

In the receiver of an 802.11a/g OFDM system, for example, this operationhas to be performed for each of the 52 subcarriers of the OFDM symbolY_(n). In a straightforward implementation, the computation requires ˜2complex multiplications and one real division per sub-carrier. This iscomputationally more intensive than implementing the FFT that requires96 complex multiplications per 52 carriers. In particular, theimplementation of a division Operation can be at least 3˜5 times morecomplex than that of a multiplication operation. Thus, it is desirableto eliminate the division or scaling operations required in the FEQ unit220.

As shown in FIG. 2, the output of the FEQ unit 220 is typically sent toa Viterbi decoder 230 to recover or estimate, based on historicalanalysis of the traffic in the channels, the most likely transmittedsequence of data symbols or bits. Hard symbol by symbol decisions (viaslicer 225) on the output of the FEQ can also be fed back to the channelestimator 210 to improve the channel estimates H _(n).

In a conventional FEQ implementation such as shown in FIG. 2, thereceived symbol for each carrier, Y_(k,n) is divided by itscorresponding channel estimate, H _(k,n) that can vary from sub-carrierto sub-carrier in a frequency selective fading environment. Thus, theexpected signal to noise ratio per symbol may be varying fromsub-carrier to sub-carrier and may deviate significantly from theaverage. This can reduce the performance of a conventional Viterbidecoder (such as decoder 230) that derives its optimal branch metricsassuming that all the symbols have the same expected Additive WhiteGaussian Noise (AWGN) noise power. Thus, it is desirable to incorporatethe so called Channel State Information (CSI) derived from the channelestimates into the Viterbi decoder metrics to minimize this effect.

It would also be desirable to simplify the configuration of the viterbidecoder and branch metric computation in particular without increasingcomplexity over conventional designs while retaining these CSIperformance benefits.

Any OFDM systems operating in fading channels, including 802.11a/g and802.16a communications systems, are susceptible to wireless channelfading and multipath interference, particularly in mobile deploymentswhere intervening terrain and buildings block or alter line-of-sightreception. To combat this, known receiver designs may employ pluralgeographically dispersed antennae in the hopes that at least one of theantennae can avoid the characteristic multipath and fading. One commontype of plural antennae receiver is called a selection diversityreceiver or simply a diversity receiver, and includes logic to ascertainwhich one of the RF receive pathways is receiving a “best” version of anincident signal (based on e.g. Received Signal Strength Indication(RSSI) analysis), and will select this “best” signal for downconversionand demodulation decoding while disregarding the remaining receivedsignals. Typically, this involves switching the RF receive pathway orchannel bearing this “best signal” into communication with the RFdownconversion and baseband processing units while isolating theremaining pathways. Performance gains here remain dependent onindividual antennae configuration and placement, but is invariablyimproved over conventional single channel designs.

Another form of the plural antennae receiver offering significant SNRbenefit is the Maximum Ratio Combining (MRC) receiver, in which all theplural received signals are utilized. In particular, the receivedsymbols within the plural signals borne by the RF receive pathways areco-phased to provide coherent voltage addition and are individuallyweighted to provide optimal SNR. See e.g. T. S. Rappaport, WirelessCommunications, Prentice Hall, Upper Saddle River, N.J. 1996, pages326-332 which is incorporated herein fully by reference. As such, thebaseband processing unit, especially the FEQ and Viterbi decoder of anMRC receiver is viewed as being especially complex, and so any reductionin such complexity, especially where performance is not affected or evenis improved, is desirable.

SUMMARY

To address these and related desires, the present invention is directedin part to improved equalization and Viterbi decoding in an MRC receiverenvironment through utilizing channel state information (CSI). CSI maybe conveniently ascertained through channel estimates of the inboundsymbol(s) within the baseband signal of interest.

The complexity associated with MRC capable Viterbi decoding consistentwith the present invention can be reduced by selectively employingcertain joint equalization and/or decoding and piecewise approximationtechniques. In accordance with one or more disclosed embodiments, jointdecoding and equalization aspects are applicable to both hard andsoft-decision Viterbi decoding implementations, and serve to eliminatethe division operations heretofore believed required by a distinctequalizer. To further simplify overall complexity, branch metriccomputation therein may conveniently employ the use of computationallyefficient piecewise linear approximations.

Additional aspect features and advantages of this invention will becomeapparent from the following detailed description of embodiments thereof,which proceeds with reference to the accompanying drawings, in whichlike reference numerals indicate like parts or features.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a simplified block diagram of a transceiver capable ofimplementing one or more features of the present invention.

FIG. 2 is a block diagram of a known receiver baseband processing unit.

FIG. 3 is a block diagram of a receiver baseband processing unitaccording to an embodiment of the invention.

FIG. 4 is a block diagram of a receiver baseband processing unitaccording to an alternative embodiment of the invention.

FIG. 5 illustrates branch metric approximation according to anembodiment of the present invention.

FIG. 6 depicts decision-making of the slicer shown in FIGS. 4 and 5consistent with the disclosed embodiments of the invention.

FIG. 7 is a block diagram of a hard-decision slicer capable ofundertaking the decision-making illustrated in FIG. 6.

FIG. 8 is a simplified block diagram of a known receiver basebandprocessing unit incorporating MRC.

FIG. 9 is a simplified block diagram of a MRC receiver basebandprocessing unit including AGC adjustment according to an embodiment ofthe invention.

FIG. 10 is a simplified block diagram of an MRC receiver basebandprocessing unit according to another embodiment of the invention.

FIG. 11 is a simplified block diagram of a diversity receptioncompatible transceiver capable of implementing one or more features ofthe present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

The first section below describes joint equalization and Viterbidecoding consistent with several disclosed embodiments of the invention,including those incorporating CSI and hard-decision decoding features.Section 2 describes complexity reduction techniques for computing thebranch metrics in a Viterbi decoder with CSI. Finally, Section 3describes Viterbi decoder complexity reduction in an MRC plural receiveantennae environment.

Section 1—Joint Equalization and Decoding

We propose eliminating the division operations in Equation (1) discussedabove and demodulate the received symbols using Method I, in rectangularform:Z _(k,n) = H _(k,n) ^(*) ·Y _(k,n),   (2)or, Method II, in polar form:P _(k,n) =e ^(jφ) ^(k,n) ·Y _(k,n),   (3)whereH _(k,n) =| H _(k,n) |e ^(jφ) ^(k,n) .   (4)The in-phase and quadrature demodulated symbols are the real andimaginary parts of X _(k,n) (i.e. RE{ X _(k,n)} and IM{ X _(k,n)})respectively. The following discusses the changes required in theconventional soft decision Viterbi decoder (such as decoder 230 shown inFIG. 2) as well as the hard-decision symbol-by-symbol (such as theslicer 225 shown in FIG. 2).

Given the proposed demodulation schemes given above, the decision orbranch metrics in the Viterbi decoder have to be modified accordingly.We again note that at the receiver, the received symbol, Y_(k,n), can bedefined in terms of a channel model (such as the channel model 201depicted in FIG. 2) such thatY _(k,n) =H _(k,n) ·X _(k,n) +V _(k,n),   (5)where X_(k,n) is the transmitted symbol of the k^(th) sub-carrier duringthe n^(th) OFDM symbol, H_(k,n), is the channel response correspondingto the k^(th) subcarrier during the n^(th) OFDM symbol, and v_(k,n) isthe AWGN in the k^(th) sub-carrier during the n^(th) OFDM symbol. Asnoted above, gain compensation need not be considered in the singlecarrier case with respect to Viterbi decoding, and is thus omitted inthis version of Equation 0.

In the following, we derive the corresponding branch metrics for the twodemodulation methods proposed above in relation to Equations (2) and(3). To simplify the notations used, we assume that the channel estimateis perfect (though shown in the FIGS. otherwise). That is,H _(k,n) =H _(k,n)  (6)and we denote the real and imaginary parts of a complex quantity as

{H _(k,n) }≡H _(k,n,0,)

_({H) _(k,n) }≡H _(k,n,1)·  (7)

We turn first to the Viterbi decoder branch metric computation fordemodulation Method I using rectangular form. Substituting Equations 5and 6 into Equation 2, we arrive atZ _(k,n) =H _(k,n) ^(*) ·Y _(k,n) =|H _(k,n)|² X _(k,n) 30 H _(k,n) ^(*)v _(k,n)  (8)and the demodulated in-phase and quadrature symbols,

{Z _(k,n) }≡Z _(k,n,0) =|H _(k,n)|² X _(k,n,0) +H _(k,n,0) ·v _(k,n,0)+H _(k,n,1) ·v _(k,n,1)  (9)and

{Z _(k,n) }≡Z _(k,n,1) =|H _(k,n)|² X _(k,n,1) +H _(k,n,0) ·v _(k,n,1)−H _(k,n,1) ·v _(k,n,0)  (10)

In a Viterbi decoder, the decision metrics used to determine the mostlikely transmitted code sequence or symbol are the path metrics that arethe accumulated branch metrics corresponding to the state transitions inthe paths. The branch metric for each transition, derived for anAdditive White Gaussian Noise (AWGN) channel, is defined as the minimumEuclidean distance between the received signal and the codewordassociated with the corresponding transition. That is, the branchmetrics corresponding to the Equations 9 and 10, BM_(k,n,i),BM _(k,n,i)=(Z _(k,n,i) −|H _(k,n)|² ·X)² =Z _(k,n,i) ²−2 Z _(k,n,i) ·|H_(k,n)|² ·X+(|H _(k,n)|² ·X)²,   (11)where iε{0,1}, and Xε{±1} for QPSK, Xε{±1, ±3} for 16-QAM, and Xε{±1,±3, ±5, ±7} for 64-QAM constellations. Since the term (Z_(k,n,i) ²) iscommon to all the branch metrics at each stage of the Viterbi decodingprocess, this term can be subtracted from all the path metrics withoutchanging the MLSE (described below) comparison results. Thus,BM _(k,n,i)=−2 Z _(k,n,i) ·|H _(k,n)|² ·X+(|H _(k,n)|² ·X)²  (12)

For QPSK, Xε{±1}, and the term (|H_(k,n)|²·X)² =|H _(k,n)|⁴ is common toall the branch metrics at each decoding stage. Thus, the term can besubtracted from all the path metrics of all the states without changingthe comparison results. The scaling factor (2) can also be removed.Thus,BM _(k,n,i) =−Z _(k,n,i) ·|H _(k,n)|² ·X for QPSK.   (13)

We note that in a fading environment, the channel response H_(k,n,i) canchange from sub-carrier to sub-carrier, and by using the above-deriveddemodulation methods, the AWGN noise in each sub-carrier symbol may nolonger have the same expected power, even if E(v_(k,n,i) ²) values arethe same. To properly normalize the noise power from sub-carrier tosub-carrier, phase demodulation should be performed relative to themagnitude of the channel response H_(k,n). Namely, we define therelationship W_(k,n,i)=Z_(k,n,i)/|H_(k,n)|, which, through substitutingEquations (9) and (10) for Z_(k,n,0) and Z_(k,n,1) respectively, weobtain:

$\begin{matrix}{{{\left\{ W_{k,n} \right\}} \equiv W_{k,n,0}} = {{{H_{k,n}} \cdot X_{k,n,0}} + \frac{\left( {{H_{k,n,0} \cdot v_{k,n,0}} + {H_{k,n,1} \cdot v_{k,n,1}}} \right)}{H_{k,n}}}} & (14)\end{matrix}$and

$\begin{matrix}{{{\left\{ W_{k,n} \right\}} \equiv W_{k,n,1}} = {{{H_{k,n}} \cdot X_{k,n,1}} + \frac{\left( {{H_{k,n,0} \cdot v_{k,n,1}} - {H_{k,n,1} \cdot v_{k,n,0}}} \right)}{H_{k,n}}}} & (15)\end{matrix}$From which, the Viterbi decoder branch metrics, BM_(k,n,i) can bederived as follows:BM _(k,n,i)=(W _(k,n,i) −|H _(k,n) |·X)² =W _(k,n,i) ²−2W _(k,n,i) ·|H_(k,n) |·X+(|H _(k,n) |·X)²,   (16)where iε{0,1}, and Xε{±1} for QPSK, Xε{±1, ±3} for 16-QAM, and Xε{±1,±3, ±5, ±7} for 64-QAM constellations. As before, the branch metric canbe simplified toBM _(k,n,i)=−2W _(k,n,i) ·|H _(k,n) |·X+(|H _(k,n) |·X)² (with CSI),  (17)andBM _(k,n,i) =−W _(k,n,i) ·|H _(k,n) |·X for QPSK (with CSI).   (18)Given that W_(k,n,i)=Z_(k,n,i)/|H_(k,n)|, the branch metricincorporating CSI demodulation method I using rectangular form,BM _(k,n,i)=−2Z _(k,n,i) ·X+(|H _(k,n) |·X)² (with CSI)   (19)Again, for QPSK, Xε{±1}, andBM _(k,n,i) =−Z _(k,n,i) ·X for QPSK (with CSI)   (20)We note that no approximation was assumed above. The division operationsrequired by the FEQ are eliminated and the channel response estimatesare incorporated into the Viterbi decoder decision metrics (inparticular, the branch metrics) instead. However, we describe in Section2 that by using a bit-by-bit piecewise branch metric approximation andincorporating CSI, the decoder complexity can be reduced significantlywith very little practical performance loss.

However, first consider Viterbi decoder branch metric computation fordemodulation Method II (using polar form). Substituting Equations 5 and6 into Equation 3, we arrive atP _(k,n) e ^(−j φk,n) ·Y _(k,n) =|H _(k,n) |·X _(k,n) +e ^(−j φk,n) ·V_(k,n)  (21)In this case, the expected noise power in each sub-carrier is the same.Thus, as will be appreciated by those ordinarily skilled in the art, nonormalization of the noise component with the channel estimates isrequired. Similar to demodulation method I described above, the branchmetrics, BM_(k,n,i), can be expressed as:BM _(k,n,i)=−2P _(k,n,i) ·|H _(k,n) |·X+(|H _(k,n) |·X)² (with CSI),  (22)where iε{0,1}, and Xε{±1} for QPSK, Xε{±1, ±3} for 16-QAM, and Xε{±1,±3, ±5, ±7} for 64-QAM constellations, and thusBM _(k,n,i) =−P _(k,n,i) |H _(k,n) |·X for QPSK (with CSI)   (23)

We note that the derivation given above is exact and therefore will notcompromise Viterbi decoder performance compared to that of aconventional receiver.

Turn now to the receiver baseband processing unit 300 according to anembodiment of the invention shown in FIG. 3 which incorporates jointequalization and decoding as noted above. Here, unlike the conventionalreceiver baseband processing unit 200 shown in FIG. 2, the divisiondependent FEQ unit 220 is eliminated, and equalization and decodingfunctions based in part on the channel estimates H _(k,n,i) areperformed directly by the Viterbi decoder 330. A phase demodulator 360issued to derive Z_(n) and/or P_(n) as noted above in Equations 2 and 3.The branch metric computation unit 332 of the Viterbi decoder calculatesthe real (i=0) and imaginary (i=1) branch metric components (or BM_(L))for each subcarrier k of the nth received OFDM symbol, Y_(n), recoveredby the FFT 208 using Equation 13 for QPSK rate symbol modulation orEquation 12 for higher rate symbol modulation (e.g. 16-QAM or 64-QAM)where reliance on CSI is not desired. Where CSI decoding improvementsare desired, the branch metric computation unit calculates the BM_(i)for each subcarrier k of the nth received OFDM symbol, Y_(n), usingEquation 20 for QPSK rate symbol modulation, or Equation 19 for higherrate symbol modulation. Note that each dimension I and Q is handledseparately as a consequence of the phase rotation provided by the phasedemodulator 360.

Once each BM_(i) is calculated by the branch metric computation unit 332for the current symbol Y_(n), they are transferred to the MaximumLikelihood Sequence Estimation unit 334 (“or “MLSE”), which performsconventional survivor path and path metric updating, as well as mostlikely path trace back to recover {circumflex over (X)}_(n). For moreinformation regarding MLSE 334 operation and functions, see e.g. Lou,Hui-Ling “Implementing the Viterbi Algorithm”, IEEE Signal ProcessingMagazine, September 1995, pages 42-52 which is incorporated herein fullyby reference.

The MLSE unit 334 estimates {circumflex over (X)}_(n) representing themost likely symbol transmitted {tilde over (X)}_(n)). In view of knownlimitations of the Viterbi algorithm {circumflex over (X)}_(n) may ormay not be the same as {tilde over (X)}_(n). As shown in FIG. 3, Z_(n)or P_(n) may also be fed to a hard-decision slicer 350 that, based onslicing rules detailed below with reference to FIGS. 6 and 7, willgenerate dec{ X _(n)} which is in turn sent to the channel estimator 310to improve the channel estimates H _(n+1). More detail on the functionsand interactions of the dynamic slicer 350 will be discussed below withreference to FIGS. 6 and 7.

In practical implementation of the Viterbi decoder 330, the branchmetrics may be quantized and the number of quantization bits minimizedto minimize the complexity in the decoder. With the joint equalizationand decoding scheme proposed above, the branch metrics becomenecessarily a function of the channel estimates H _(k,n). Thus, thequantization noise of the branch metrics are affected by thequantization noise of the channel estimates. Furthermore, since thechannel estimates change dynamically, these quantization levels shouldbe determined dynamically in order to maintain or improve receiverperformance.

To minimize the quantization noise for these channel estimates H _(k,n),the maximum or average value of the channel estimates should bedetermined and normalized before subjecting to quantization. That is,comparison operations are needed in such case to find the maximum oraverage value, and division operations are required to implement thenormalization prior to quantization. Furthermore, if the convolutionalcoder 262 encodes over the duration of a packet, all the channelestimates corresponding to the same packet duration should be subjectedto the same normalization factor. This can significantly introduce delayin the decoder as the proper normalization factor can only be determinedafter the whole packet is received.

However, we note that in 802.11a/g or 802.16a compliant communicationssystems, the channels are quasi static so that we can approximate oursearch for the maximum or average by looking at the first transmittedOFDM. That is, we assumeH _(k,0) ≈H _(k,1) ≈H _(k,2) ^(. . .) ,   (24)and for the 802.11a system, we determine the normalization factor usingthe channel estimates for the 52 tones of the first transmitted OFDMsymbols of the encoder block, {H_(0,0), H_(1,0), . . . , H_(51,0)}.

Consistent with our desire to reduce decoder complexity, instead ofcomparing and dividing to find the normalization value and performingnormalization, we propose a simplified normalization method instead. Toillustrate our proposed technique, we assume that the desirednormalization factor is the maximum value of the squared magnitude ofthe channel estimates. We note that this value is bounded by a power of2. Thus, we compute max |H_(k,0)|² over all the subcarriers in the firstOFDM symbol, where k={0, 1, 2, . . . , 51}, at least in the 802.11acase. To illustrate our approach to search, normalize and quantize, weassume |H_(k,0)|² are 10-bit in unsigned notation:|H _(k,0)|^(2={) b _(k,0,0,) b _(k,0,1,) . . . , b _(k,0,9)},   (25)where b_(k,0,0) is the Most Significant Bit (MSB). We further assumethat the resultant |H_(k,0)|² are to be quantized to 6 bits. Denoting‘^’ a logical OR operation and ‘&’ a logical AND operation, we proposethe following pseudocode to arrive at |H_(k,0)|²:if (b _(0,0,0) Λb _(1,0,0) Λb _(2,0,0) Λ. . . Λb _(51,0,0)=1)|H _(k,0)|²⁼ |H _(k,0)|² & 1111110000exitelseif (b _(0,0,1) Λb _(1,0,1) Λb _(2,0,1) Λ. . . Λb _(51,0,1)=1)|H _(k,0)|²⁼ |H _(k,0)|² & 0111111000exitelseif (b _(0,0,2) Λb _(1,0,2) Λb _(2,0,2) Λ. . . Λb _(51,0,2)=1)|H _(k,0)|²⁼ |H _(k,0)|² & 00111100exitelseif (b _(0,0,3) Λb _(1,0,3) Λb _(2,0,3) Λ. . . Λb _(51,0,3)=1)|H _(k,0)|²⁼ |H _(k,0)|² & 0001111110exitelse|H _(k,0)|²⁼ |H _(k,0)|² & 0000111111endif

As mentioned previously, in many practical receiver designs,hard-decision decoding is performed on the output symbols of the FEQ tofind their closest constellation points in order to performdecision-directed equalization or channel estimation. To determine thehard decision, we denote Dec{ X _(k,n)} as the closest QAM constellationpoint to X _(k,n), using hard decision decoding, and X _(k,n) iscomputed using equation 1,

${{\overset{\_}{X}}_{k,n} = {\frac{Y_{k,n}}{{\overset{\_}{H}}_{k,n}} = {X_{k,n} + \frac{v_{k,n}}{{\overset{\_}{H}}_{k,n}}}}},$where X_(k,n,i)ε{±1} for QPSK, X_(k,n,i)ε{±1,±3}for 16-QAM, andX_(k,n,i)ε{±1,±3,±5,±7} for 64-QAM constellations, and iε{0,1}represents the in-phase (I) and quadrature (Q) components of X_(k,n). Inthis case, the hard-decision decoded symbol, Dec { X _(k,n)}, can becomputed by rounding X _(k,n,i) to its corresponding nearestconstellation point, X_(k,n,i), in each dimension.

However, by using the division-free demodulation techniques in Equations2 and 3, and from Equations 8 and 21 where,Z _(k,n) =| H _(k,n)|² · X _(k,n) =|H _(k,n)|² ·X _(k,n) =H _(k,n) ^(*)V _(k,n),   (28)andP _(k,n) =| H _(k,n) |· X _(k,n) =|H _(k,n) |·X _(k,n) +e ^(−jφk,n) ·V_(k,n),   (29)the hard-decision symbol, Dec{ X _(k,n)} needs to be computed givenZ_(k,n) or P_(k,n), and both terms contain the instantaneous channelestimate | H _(k,n)|. Thus, a dynamic slicer (e.g. slicer 350) based onthe current values of | H _(k,n)| should be used to determine Dec{ X_(k,n)}.

By using the proposed demodulation technique given in Equation 2, thefollowing slicing rules presented below in pseudocode form can be usedto make a hard decision on the in-phase and quadrature components to thenearest constellation point in a QPSK, 16-QAM or 64-QAM constellation.

Slicer Rule for QPSK:if (Z _(k,n,i)≧0),Dec{ X _(k,n,i)}=1,otherwise, Dec{ X _(k,n,i)}=−1.Slicer Rule for 16-QAM:if ((|Z _(k,n,i)|−2| H _(k,n)|²)<0), Dec{ X _(k,n,i)}=±1,otherwise Dec{ X _(k,n,i)}=±3.

The sign is dependent on the sign of Z_(k,n,i) (see e.g. FIG. 6). Astraightforward implementation of the slicer 350 is shown in FIG. 7 toillustrate that this slicer 350 can be implemented by a combination ofmultiplexers 710, 730 and an adder 720.

Pseudocode for the 64-QAM rate is provided below:

Slicer Rule for 64-QAM:if ((|Z _(k,n,i)|−2| H _(k,n)|²)<0),Dec{ X _(k,n,i)}=±1,exit; if((|Z _(k,n,i)|−3| H _(k,n)|²)<0),Dec{ X _(k,n,i)}=±3,exit; if((|Z _(k,n,i)|−6| H _(k,n)|²)<0),Dec{ X _(k,n,i)}=±5,exit;Dec{ X _(k,n,i)}=±7.exit;The sign is dependent on the sign of Z_(k,n,i).

By using the proposed demodulation technique given in Equation 3,similar slicing rules can be derived for QPSK, 16-QAM and 64-QAMconstellations to compute Dec{ X _(k,n)}.

Slicer Rule for QPSK:if (P _(k,n,i)>0),Dec{ X _(k,n,i)}=1,otherwise Dec{ X _(k,n,i)}=−1.Slicer Rule for 16-QAM:if ((|P _(k,n,i)|−2| H _(k,n)|)<0),Dec{ X _(k,n,i)}=±1,otherwise Dec{ X _(k,n,i)}=±3.The sign is dependent on the sign of P_(k,n,i).Slicer Rule for 64-QAM:if ((|Z _(k,n,i)|−2| H _(k,n)|²)<0),Dec{ X _(k,n,i)}=±1,exit;if ((|Z _(k,n,i)|−3| H _(k,n)|²)<0),Dec{ X _(k,n,i)}=±3,exit;if ((|Z _(k,n,i)|−6| H _(k,n)|²)<0),Dec{ X _(k,n,i)}=±5,exit;Dec{ X _(k,n,i)}=±7.exit;The sign is dependent on the sign of P_(k,n,i).Section 2—Reduced Complexity Viterbi Decoder Decision Metrics withChannel State Information

This section introduces an approximation method to compute the Viterbidecoder branch metrics that can significantly reduce the computationrequired over known systems, and can be used in isolation or incombination with the joint equalization and decoding techniquesdescribed herein. This method is particularly beneficial to systemswhere interleaving is performed between the convolutional encoder outputand the QAM symbol mapper, as with the case in 802.11a, 802.11g and802.16a compliant communications.

To summarize the novel bit-by-bit linear piecewise approximationapproach, we represent the I and Q demodulated symbol, X _(k,n,0) or X_(k,n,1) in bits. That is, if X _(k,n) is a demodulated symbol of a16-QAM constellation, we can represent the real-part of X _(k,n) by,X _(k,n,l) ={b ₀ ,b ₁},   (30)

and determine the corresponding branch metrics for b₀ and b₁ in theViterbi decoder. The expression to compute the branch metric depends onthe piecewise region the demodulated I or Q symbol is in, and theposition of bit, b₀ or b₁, for which the branch metric is to becomputed. However, all the expressions take the form:BM _(k,n,i)=−( X _(k,n,i) ^(−m))·sign(b _(i)),   (31)where m=0 for QPSK, mε{0,2} for 16-QAM and mε{0,2,4} for 64-QAMconstellations, and b_(i) ε{±1}.

To improve the Viterbi decoder performance, CSI may be incorporated tonormalize the expected noise power appropriately as described above inSection 1. If W_(k,n) is demodulated using Form Equation 18, thepiecewise branch metric should be (±W_(k,n,i)·|H_(k,n)|). That is, theslope of the branch metrics will be ±|H_(k,n)|, depending on whether thesign of b_(i) is −1 or 1. Furthermore, the piecewise decision regionsare separated by m·|H_(k,n)| (see Equations 14 and 15), where m=0 forQPSK, mε{0,2} for 16-QAM and mε{0,2,4} for 64-QAM constellations. Inshort, the branch metrics will be of the form,BM _(k,n,i) =−|H _(k,n)|(|W _(k,n) |−|H _(k,n) |·m)·sign(b _(i)) (withCSI),   (32)

If the conventional demodulation method (Equation 1) is used,

$\begin{matrix}{{\overset{\_}{X}}_{k,n} = {\frac{W_{k,n}}{H_{k,n}}.}} & (33)\end{matrix}$Thus, the equations to compute the branch metrics have the form,BM _(k,n,i) =−|H _(k,n)|²(| X _(k,n,i)|^(−m))·sign(b _(i)),   (34)

FIG. 4 depicts a receiver baseband processing unit 400 in which unlikethe embodiment shown in FIG. 3, still includes a separate demod/FEQ 220and Viterbi decoder 430. However, the Viterbi decoder 430 differs fromthe conventional Viterbi decoder 230 shown in FIG. 2 in that it includesa branch metric computation unit 432 that generates BM_(i) for eachsubcarrier of a given OFDM symbol Y using the relationship defined inEquation 34. Similarly, it can be shown that by using thereduced-complexity joint equalization and decoding approach describedabove, and depending on the demodulation method chosen (Equations 2 or3), the bit-by-bit piecewise approximation branch metrics have the form:BM _(k,n,i)=−(|Z _(k,n) |−|H _(k,n)|²·m)·sign(b _(i)),   (35)orBM _(k,n,i) =−|H _(k,n)|(|P _(k,n,i) |−|H _(k,n)|·m)·sign(b _(i)),  (36)where m=0 for QPSK, mε{0,2} for 16-QAM and mε{0,2,4} for 64-QAMconstellations, and b_(i) ε{±1}.

FIG. 5 illustrates the branch metric approximation for a 16-QAMconstellation where the demodulated symbol is Z_(k,n,i). As mentionedpreviously, though not required, the branch metric approximations notedin Equations 35 and 36 may be conveniently implemented by the branchmetric computation unit 332 shown in FIG. 3, which in simulationproduced an 8 dB SNR performance gain.

Section 3—Multiple Receive Antenna Equalization and Decoding

The previous two sections assume a single receive antenna is used. Thissection addresses the MRC multiple receive antennae case. A simplifiedconceptual block diagram of a D-path receive diversity system is shownin FIG. 8 for a single subcarrier k (channel mode 801). In this example,X_(k,n) was received through D independent pathways and the D receivedsymbols Y_(k,n) ⁽⁰⁾, Y_(k,n) ⁽¹⁾, . . . Y_(k,n) ^((D-1)) are to bedemodulated and decoded. In Maximum Ratio Combining (MRC), the receivedsymbols are co-phased to provide coherent voltage addition and areindividually weighted to provide optimal SNR. Assuming that perfectchannel knowledge is available at the receiver, each receiver chain hasthe same average noise power σ², and the channel is flat-fading, theoptimal MRC output generated by the MRC combine FEQ and demodulationunit 810, is given by

${\overset{\_}{X}}_{k,n} = {\frac{\sum\limits_{d = 0}^{D - 1}\;{H_{k,n}^{{(d)}^{*}}Y_{k,n}^{(d)}}}{\sum\limits_{d = 0}^{D - 1}\;{H_{k,n}^{(d)}}^{2}}.}$Substituting

$\begin{matrix}{{Y_{k,n}^{(d)} = {{H_{k,n}^{(d)} \cdot X_{k,n}} + v_{k,n}^{(d)}}},{{Equation}\mspace{14mu}(37)\;{may}\mspace{14mu}{be}\mspace{14mu}{rewritten}\mspace{14mu}{as}}} & (38)\end{matrix}$

$\begin{matrix}{{\overset{\_}{X}}_{k,n} = {X_{k,n} + \frac{\sum\limits_{d = 0}^{D - 1}\;{H_{k,n}^{{(d)}^{*}}v_{k,n}^{(d)}}}{\sum\limits_{d = 0}^{D - 1}{H_{k,n}^{(d)}}^{2}}}} & (39)\end{matrix}$This signal is demodulated, and the I and Q components, Re{ X _(k,n)}and IM{ X _(k,n)}, are sent to the Viterbi decoder 830.

Similar to the one receive antenna case, after MRC, the expected noisepower of the symbols sent to the Viterbi decoder will no longer be thesame. To optimize the Viterbi decoder performance consistent with thepresent invention, CSI should be incorporated appropriately to normalizethe noise power from symbol to symbol so that their expected noise powerequal to σ². Referring to the derivation in the one receiver antennacase (Equations 14 and 15), one can derive that for the MRC case, takinginto consideration of CSI for Viterbi decoding, is

$\begin{matrix}{{\overset{\_}{X}}_{k,n}^{CSI} = {\frac{\sum\limits_{d = 0}^{D - 1}{H_{k,n}^{{(d)}^{*}}Y_{k,n}^{(d)}}}{\sqrt{\sum\limits_{d = 0}^{D - 1}{H_{k,n}^{(d)}}^{2}}}.}} & (40)\end{matrix}$Denoting

$\begin{matrix}{{{\hat{H}}_{k,n} = \sqrt{\sum\limits_{d = 0}^{D - 1}{H_{k,n}^{(d)}}^{2}}},} & (41)\end{matrix}$and similar to the one receive antenna case, the branch metriccomputation handled by the branch metric computation unit 1032 of theViterbi decoder 1030 can be expressed as:BM _(k,n,i)=−2 X _(k,n,i) ^(CSI) ·Ĥ _(k,n) ·X+(Ĥ _(k,n) ·X)² (MRC withCSI),   (42)where iε{0,1}, and Xε{±1} for QPSK, Xε{±1, ±3} for 16-QAM, and Xε{±1,±3, ±5, ±7} for 64-QAM constellations. For QPSK, the relationshipsimplifies toBM _(k,n,i) =− X _(k,n,i) ^(CSI) ·Ĥ _(k,n) ·X (MRC with CSI).   (43)

In accordance with the joint equalization and decoding techniquesdescribed above with reference to Section 1, to reduce the receivercomplexity, the division operations in the demodulator can be eliminatedby first co-phasing the received signals from the different antennaebefore adding their contributions together.Z _(k,n)=Σ_(d=0) ^(D−1) H _(k,n) ^((d))  (44)and computing the branch metrics using,BM _(k,n,i)=−2Z _(k,n,i) ·X+Ĥ _(k,n) ^(4 ·X) ² (MRC with CSI),   (45)where iε{0,1}, and Xε{±1} for QPSK, Xε{±1, ±3} for 16-QAM, and Xε{±1,±3, ±5, ±7} for 64-QAM constellations. For QPSK, the branch metricssimplify toBM _(k,n,i) =−Z _(k,n,i) ·X for QPSK (MRC with CSI).   (46)

To further simplify the branch metric computation, the bit-by-bitpiecewise approximation technique described above can be applied tocompute the branch metrics for the branch computation unit 1032 of theViterbi decoder 1030 (FIG. 10). In this case, the expressions to computethe branch metrics have the form,i BM_(k,n,i)=−(|Z _(k,n,i) |−Ĥ _(k,n,) ² ·m)·sign(b _(i)),   (47)where m=0 for QPSK, mε{0,2} for 16-QAM and mε{0,2,4} for 64-QAMconstellations, and b_(i) ε{±1}.

In a practical MRC receiver design, the received signal in each receivepathway will pass through an Automatic Gain Control (AGC) (not shown)prior to frequency domain conversion through an individual pathway FFT(not shown) so that the dynamic range of the Analog-to-Digital Convertor(ADC) can be fully utilized. A simplified conceptual block diagramillustrating this feature is shown in FIG. 9. A gain, denoted g^((d))for branch or pathway d is applied to the received symbol Y_(k,n) ^((d))as noted in the channel model 901. Thus, the available received symbolat the receiver is,{tilde over (Y)} _(k,n) ^((d)) =g ^((d)) ·Y _(k,n) ^((d)),  (48)and the channel estimates can be expressed as:{tilde over (H)} _(k,n) ^((d)) =g ^((d)) ·H _(k,n) ^((d)),  (49)

Given that each receiver pathway is subjected to a different multipathchannel, the gain can be different for each receiver pathway. In orderto weight and normalize the MRC and the Viterbi decoder branch metricsproperly, we substitute Equations 48 and 49 into Equation 40 to deriveMRC with CSI, taking into consideration of the AGC gain in each receiverchain as follows:

$\begin{matrix}{{\overset{\_}{X}}_{k,n}^{{CSI},{AGC}} = \frac{\sum\limits_{d = 0}^{D - 1}\;{\left( g^{(d)} \right)^{- 2}{\overset{\sim}{H}}_{k,n}^{{(d)}^{*}}{\overset{\sim}{Y}}_{k,n}^{(d)}}}{\sqrt{\sum\limits_{d = 0}^{({D - 1})}\;{\left( g^{(d)} \right)^{- 2}{{\overset{\sim}{H}}_{k,n}^{(d)}}^{2}}}}} & (50)\end{matrix}$

Similarly, the equivalent branch metrics in terms of Y _(k,n) and H_(k,n) can be derived. For example, to implement the division-freedemodulator within e.g. the MRC combine and demodulation unit 910 shownin the embodiment of FIG. 9,Z _(k,n)=Σ_(d=0) ^(D−1)(g ^((d)))⁻² {tilde over (H)} _(k,n) ^((d)*){tilde over (Y)} _(k,n) ^((d))  (51)and the branch metric, using the bit-by-bit piecewise approximationapproach discussed herein is,BM _(k,n,i)=(−|Z _(k,n,i)|+

_(k,n) ²·m)·sign(b _(i)) (MRC with CSI)  (52)where

$\begin{matrix}{{\overset{\Cup}{H}}_{k,n} = \sqrt{\sum\limits_{m = 0}^{D - 1}\;{\left( g^{(m)} \right)^{- 2}{{\overset{\sim}{H}}_{k,n}^{(m)}}^{2}}}} & (53)\end{matrix}$and where m=0 for QPSK, mε{0,2} for 16-QAM and Mε{0,2,4} for 64-QAMconstellations, and b_(i) ε{±1}.

For the case with 2 receive antennae, D=2, the demodulator using MRC isreduced to,Z _(k,n,) ={tilde over (H)} _(k,n) ^((0)*) ·{tilde over (Y)} _(k,n)⁽⁰⁾+β·{tilde over (H)}_(k,n) ^((1)*) ·{tilde over (Y)} _(k,n) ⁽¹⁾  (54)and the branch metric, using the bit-by-bit piecewise approximationapproach is,BM _(k,n,i)=(−|Z _(k,n,i)|+({tilde over (H)} _(k,n) ⁽⁰⁾²+β·{tilde over(H)}_(k,n) ⁽¹⁾²)·m)·sign(b _(i)) (MRC with CSI)  (55)where

$\begin{matrix}{\beta = \left( \frac{g^{(0)}}{g^{(1)}} \right)^{2}} & (56)\end{matrix}$

These practical receiver branch metric calculations may be convenientlyundertaken in the branch metric computation unit 932 of the Viterbidecoder 930 as part of the MRC capable receiver baseband processing unit900 shown in FIG. 9. If utilized, simulation results show at least a IdB SNR improvement.

In the above derivations, we assume that the gain for each receiverpathway or chain is a constant for each chain. This is true for an OFDMsystem where all the sub-carriers are subjected to same gain.Furthermore, in a quasi-static channel, the gain for each receiver chainthroughout the packet burst remains constant. Therefore, when there isonly one receive antenna, all the symbols are subjected to the same gainand therefore the gain factor can be ignored without affecting thedecoder performance. For systems where this gain can change from symbolto symbol, the different gain factor for each symbol should be takeninto consideration in the derivation of the demodulator and the branchmetric computation, even for the single receive antenna case. Thederivation is similar to that of the case with multiple antennae.

Turning briefly to FIG. 1, FIG. 1 illustrates a wireless communicationstransceiver 100 capable of implementing the receiver baseband processingunits shown in FIG. 3 or 4. In this embodiment, inbound RF signalsconveying a 802.11a/g or 802.16a compliant frame of OFDM encoded symbolsare picked up by the duplex antenna 110 and routed to the RF receiverunit 115 of a receiver 150 arranged in a manner consistent with thepresent invention. The RF receiver unit 115 performs routinedownconversion and automatic gain control of the inbound RF signals, andpresents an analog baseband signal containing the aforementioned802.11a/g or 802.16a frame of OFDM symbols to the receive basebandprocessor 120, which can conveniently comprise the receiver basebandprocessing unit 300, 400 described above. Generally speaking, thereceive baseband processor 120 performs symbol demodulation of the eachinbound 802.11a/g or 802.16a compliant frame to recover bitstream datafor receiver synchronization (preamble), frame or packet definition(header), or the actual inbound data of interest (payload). Consistentwith the present invention, this processor 120 may include either units300 or 400 to carry out joint decoding and equalization or reducedcomplexity decoding as described above.

Once recovered by the receive baseband processor 120, the inbound datacontained in each received 802.11a/g or 802.16a formatted frame isdelivered to a network interface such as the MAC layer interface 125 andthen on to higher layer applications and devices being serviced by thetransceiver 100. Outbound data intended for wireless transmissionoriginating from the device(s) or application(s) being serviced by thetransceiver 100 are delivered to the transmit baseband processor 135 ofthe transmitter 160 from the MAC interface 125. The transmit basebandprocessor 135 formulates appropriate 802.11a/g or 802.16a frame preambleand header information, and OFDM symbol encodes the outbound data togenerate one or more complete outbound 802.11a/g or 802.16a frames. Asthe frame or packet is being developed, it is converted into analog formsuitable for upconversion and RF transmission by the RF transmitter unit140 consistent with 802.11a/g or 802.16a physical layer requirements.

Though only a single duplex antenna arrangement is shown in FIG. 1, thetransceiver 100 can be easily adapted to incorporate multiple receivepathways or chains to take advantage of selection diversity or MRCdiversity techniques as discussed above. To illustrate, consider thetransceiver 101 in FIG. 11 which includes plural receive antenna (e.g.antennae 114, 111, and 112) respectively coupled to individual receivepathway RF receivers (e.g. 115, 116 and 117) as part of the receiver151. In turn, the individual baseband signals recovered by thesedistinct receive pathway RF receivers are fed to a common receivebaseband processor 121, which can conveniently implement an MRC awarereceive baseband processing unit 1000 or 900 shown in FIGS. 10 and 9respectively. A separate antenna 113 is shown in FIG. 11 to radiate theRF signal generated by the transmitter 160, though other types ofantennae configuration may be utilized, as is known in the art.

Also, though not shown in FIG. 1 or 11, the transceiver 100, 101 mayform an operational part of a network interface apparatus such as a PCcard or network interface card capable of interfacing with the CPU orinformation processor of an information processing apparatus such as adesktop or laptop computer, and may be integrated within and constitutea part of such information processing apparatus. This network interfaceapparatus may alternatively form an operational component of a wirelesscommunications access point such as a base station as will beappreciated by these ordinarily skilled in the art.

It will be obvious to those having skill in the art that many changesmay be made to the details of the above-described embodiments of thisinvention without departing from the underlying principles thereof. Forexample, although the above-described embodiments deal with OFDM symboldecoding, the teachings of the invention are not intended to be solimiting, and in fact several aspects of the present invention may beapplied to other types of receivers decoding orthogonal class symbolmodulated data. To illustrate, joint equalization and decoding aspectsof the invention may be easily applied to reducing pre-demodulationdivision operations in time domain applications, including adaptivecomplex gain normalization of the time domain signal to offset AGCside-effects when seeking to maximize the dynamic range of the ADC. Thescope of the present invention should, therefore, be determined only bythe following claims.

What is claimed is:
 1. A receiver, comprising: a plurality of receiverpathways configured to (i) receive, via respective receive antennas, aradio frequency signal transmitted over a communication channel and (ii)generate a plurality of respective baseband signals corresponding to theradio frequency signal; a channel estimator configured to generate anestimate of the communication channel based on the plurality ofrespective baseband signals; a demodulator configured to (i) generate,based on the plurality of respective baseband signals and the estimateof the communication channel, channel state information corresponding tothe communication channel, (ii) perform maximum ratio combining on theplurality of respective baseband signals using the channel stateinformation, and (iii) generate, based on the estimate of thecommunication channel, a plurality of demodulated symbols thatincorporate the channel state information; and a decoder configured toperform decoding on the plurality of demodulated symbols thatincorporate the channel state information in order to generaterespective decoded symbols.
 2. The receiver of claim 1, wherein (i) theradio frequency signal includes a time domain analog OrthogonalFrequency Division Multiplexing symbol and (ii) the respective basebandsignals include respective frequency domain digital Orthogonal FrequencyDivision Multiplexing symbols.
 3. The receiver of claim 2, wherein, togenerate the estimate of the communication channel, the channelestimator is configured to generate the estimate of the communicationchannel for each sub-carrier of the respective frequency domain digitalOrthogonal Frequency Division Multiplexing symbols.
 4. The receiver ofclaim 2, wherein, to generate the channel state informationcorresponding to the communication channel, the demodulator isconfigured to generate channel state information corresponding to eachsub-carrier of the respective frequency domain digital OrthogonalFrequency Division Multiplexing symbols.
 5. The receiver of claim 2,wherein, to generate the plurality of demodulated symbols thatincorporate the channel state information, the demodulator is configuredto generate the plurality of demodulated symbols for each sub-carrier ofthe respective frequency domain digital Orthogonal Frequency DivisionMultiplexing symbols, and wherein each demodulated symbol corresponds toa given sub-carrier of the respective frequency domain digitalOrthogonal Frequency Division Multiplexing symbols.
 6. The receiver ofclaim 5, wherein, to generate the respective decoded symbols, thedecoder is configured to generate each of the respective decoded symbolsbased on the channel state information corresponding to the givensub-carrier corresponding to the demodulated symbol.
 7. The receiver ofclaim 1, wherein the decoder is further configured to generate branchmetrics to perform the decoding on the plurality of demodulated symbolsthat incorporate the channel state information.
 8. The receiver of claim7, wherein the decoder is configured to generate the branch metricsusing piecewise linear approximation.
 9. The receiver of claim 1,wherein, to perform the maximum ratio combining on the plurality ofrespective baseband signals using the channel state information, thedemodulator is configured to incorporate respective gains applied toeach of the plurality of receiver pathways.
 10. A method of operating areceiver, the method comprising: receiving, at a plurality of receiverpathways via respective receive antennas, a radio frequency signaltransmitted over a communication channel; generating a plurality ofrespective baseband signals corresponding to the radio frequency signal;generating an estimate of the communication channel based on theplurality of respective baseband signals; generating, based on theplurality of respective baseband signals and the estimate of thecommunication channel, channel state information corresponding to thecommunication channel; performing maximum ratio combining on theplurality of respective baseband signals using the channel stateinformation; and generating, based on the estimate of the communicationchannel, a plurality of demodulated symbols that incorporate the channelstate information; and performing decoding on the plurality ofdemodulated symbols that incorporate the channel state information inorder to generate respective decoded symbols.
 11. The method of claim10, wherein (i) the radio frequency signal includes a time domain analogOrthogonal Frequency Division Multiplexing symbol and (ii) therespective baseband signals include respective frequency domain digitalOrthogonal Frequency Division Multiplexing symbols.
 12. The method ofclaim 11, wherein generating the estimate of the communication channelincludes generating the estimate of the communication channel for eachsub-carrier of the respective frequency domain digital OrthogonalFrequency Division Multiplexing symbols.
 13. The method of claim 11,wherein generating the channel state information corresponding to thecommunication channel includes generating channel state informationcorresponding to each sub-carrier of the respective frequency domaindigital Orthogonal Frequency Division Multiplexing symbols.
 14. Themethod of claim 11, wherein generating the plurality of demodulatedsymbols that incorporate the channel state information includesgenerating the plurality of demodulated symbols for each sub-carrier ofthe respective frequency domain digital Orthogonal Frequency DivisionMultiplexing symbols, and wherein each demodulated symbol corresponds toa given sub-carrier of the respective frequency domain digitalOrthogonal Frequency Division Multiplexing symbols.
 15. The method ofclaim 14, wherein generating the respective decoded symbols includesgenerating each of the respective decoded symbols based on the channelstate information corresponding to the given sub-carrier correspondingto the demodulated symbol.
 16. The method of claim 10, furthercomprising generating branch metrics to perform the decoding on theplurality of demodulated symbols that incorporate the channel stateinformation.
 17. The method of claim 16, wherein generating the branchmetrics includes generating the branch metrics using piecewise linearapproximation.
 18. The method of claim 10, wherein performing themaximum ratio combining on the plurality of respective baseband signalsusing the channel state information includes incorporating respectivegains applied to each of the plurality of receiver pathways.